Real Root Isolation using the Descartes Method . ?
نویسندگان
چکیده
Two new scheduling algorithms are presented. They are used to isolate polynomial real roots on massively parallel systems. One algorithm schedules computations modeled by a pyramid DAG. This is a directed acyclic graph isomorphic to Pascal’s triangle. Pyramid DAGs are scheduled so that the communication overhead is linear. The other algorithm schedules parallelizable independent tasks that have identical computing time functions in the number of processors. The two algorithms are combined to schedule a tree-search for polynomial real roots; the first algorithm schedules the computations associated with each node of the tree; the second algorithm schedules the nodes on each level of the tree.
منابع مشابه
Implementation of Real Root Isolation Algorithms in Mathematica
In this paper we compare two real root isolation methods using Descartes’ Rule of Signs: the Interval Bisection method, and the Continued Fractions method. We present some time-saving improvements to both methods. Comparing computation times we conclude that the Continued Fractions method works much faster save for the case of very many very large roots.
متن کاملParallel Real Root Isolation Using the Descartes Method
Many sequential methods for polynomial real root isolation proceed by interval bisection. The associated binary search trees tend to be narrow and hence do not offer much parallelism. For this reason, it is not obvious how real roots can be isolated in parallel. The paper presents an approach that parallelizes the computations associated with each node of the search tree. In the Descartes metho...
متن کاملReal root isolation for exact and approximate polynomials using Descartes' rule of signs
Collins und Akritas (1976) have described the Descartes method for isolating the real roots of an integer polynomial in one variable. This method recursively subdivides an initial interval until Descartes’ Rule of Signs indicates that all roots have been isolated. The partial converse of Descartes’ Rule by Obreshkoff (1952) in conjunction with the bound of Mahler (1964) and Davenport (1985) lea...
متن کاملA Heuristic Approach to Positive Root Isolation for Multiple Power Sums
Given a multiple power sum (extending polynomial’s exponents to real numbers), the positive root isolation problem is to find a list of disjoint intervals, satisfying that they contain all positive roots and each of them contains exactly distinct one. In this paper, we develop the pseudo-derivative sequences for multiple power sums, then generalize Fourier’s theorem and Descartes’ sign rule for...
متن کاملOn the complexity of real root isolation using continued fractions
We present algorithmic, complexity and implementation results concerning real root isolation of integer univariate polynomials using the continued fraction expansion of real algebraic numbers. One motivation is to explain the method’s good performance in practice. We derive an expected complexity bound of ÕB(d + d4τ2), where d is the polynomial degree and τ bounds the coefficient bit size, usin...
متن کاملA Deterministic Descartes Algorithm for Real Polynomials
We describe a Descartes algorithm for root isolation of polynomials with real coefficients. It is assumed that the coefficients of the polynomial can be approximated with arbitrary precision; exact computation in the field of coefficients is not required. We refer to such coefficients as bitstream coefficients. The algorithm is deterministic and has almost the same asymptotic complexity as the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999